PBS: A Unified Priority-Based CPU Scheduler
نویسندگان
چکیده
A novel CPU scheduling policy is designed and implemented. It is a configurable policy in the sense that a tunable parameter is provided to change its behavior. With different settings of the parameter, this policy can emulate the first-come first-serve, the processing sharing, or the feedback policies, as well as different levels of their mixtures. This policy is implemented in the Linux kernel as a replacement of the default scheduler. The drastic changes of behaviors as the parameter changes are analyzed and simulated. Its performance is measured with the real systems by the workload generators and benchmarks.
منابع مشابه
Heterogeneous CPU Services Using Differentiated Admission
We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to ...
متن کاملARC-H: Uniform CPU Scheduling for Heterogeneous Services
Extending our work on adaptive rate-controlled scheduling, we present a novel CPU scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements without resorting to scheduling algorithms of diverse types. Rather, it employs uniform rate-based sharing, and application heterogeneity is satisfied by partitionin...
متن کاملScheduler-Aware Virtual Memory Management
Virtual memory management has come to play an increasingly adversarial role in the scheduling of processes. While it is the job of the CPU scheduler to determine the order and length of execution of processes, its attempts to meet the desired scheduling constraints are thwarted by the memory manager under memory pressure. This is because scheduler policies like priority are not supported by mem...
متن کاملFuzzy Priority CPU Scheduling Algorithm
There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU scheduling algorithm has been proposed...
متن کاملPerformance Evaluation of CPU Isolation Mechanisms in a Multimedia OS Kernel
To allow continuous media (CM) applications fine-grained control over their CPU allocations, and to protect these allocations from each other, thread priorities must have quality-of-service (QoS) interpretation. To this end, we present a CPU scheduler based on the well-defined resource specification of service curve. Service curve is distinguished from the traditional notion of rate by its abil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007